A type checking algorithm for qualified session types

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A type checking algorithm for qualified session types

We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve as unrestricted channels. Session protocols are described by a type constru...

متن کامل

An Algorithm for Type-Checking Dependent Types

We present a simple type-checker for a language with dependent types and let expressions, with a simple proof of correctness.

متن کامل

Type checking a multithreaded functional language with session types

We define a language whose type system, incorporating session types, allows com-plex protocols to be specified by types and verified by static typechecking. A ses-sion type, associated with a communication channel, specifies the state transitionsof a protocol and also the data types of messages associated with transitions; thustypechecking can verify both correctness of indi...

متن کامل

Algorithmic type checking for a pi-calculus with name matching and session types

We present a type checking algorithm for establishing a session-based discipline in a π-calculus with name matching. We account for analyzing processes exhibiting different behaviours in the branches of the if-then-else by imposing an affine discipline for session types. This permits to obtain type-safety or absence of communication errors while accepting processes of the form ifx = y thenP els...

متن کامل

Coherence for qualified types

The meaning of programs in a language with implicit overloading can be described by translating them into a second language that makes the use of overloading explicit. A single program may have many distinct translations and it is important to show that any two translations are semantically equivalent to ensure that the meaning of the original program is well-defined. This property is commonly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2011

ISSN: 2075-2180

DOI: 10.4204/eptcs.61.7